A Linear Code and its Application into Secret Sharing
نویسندگان
چکیده
We introduce a linear code based on resilient maps on vector spaces over finite fields, we give a basis of this code and upper and lower bounds for its minimal distance. Then the use of the introduced code for building vector space secret sharing schemes is explained and an estimation of the robustness of the schemes against cheaters is provided.
منابع مشابه
A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملHigh-order Masking by Using Coding Theory and Its Application to AES
To guarantee that some implementation of a cryptographic scheme is secure against side channel analysis, one needs to formally prove its leakage resilience. A relatively recent trend is to apply methods pertaining to the field of Multi-Party Computation: in particular this means applying secret sharing techniques to design masking countermeasures. It is known besides that there is a strong conn...
متن کاملSecret Sharing Schemes from a Class of Linear Codes over Finite Chain Ring ⋆
In general, every linear code can be used to construct a secret sharing scheme. However, determining the access structure of the secret sharing scheme based on a linear code is a very difficult problem. In this paper, we first construct a class of two-weight linear code over finite chain ring Fq[u]/⟨u⟩. Then, we present an access structure of the secret sharing scheme based on the two-weight li...
متن کاملSecret Sharing Schemes Based on Resilient Boolean Maps
We introduce a linear code based on resilient maps on vector spaces over finite fields, we give a basis of this code and upper and lower bounds for its minimal distance. Then the use of the introduced code for building vector space secret sharing schemes is explained and an estimation of the robustness of the schemes against cheaters is provided.
متن کاملA Secret Sharing Scheme from a Chain Ring Linear Code
After the seminal papers [3] and [11] the secret sharing problem has received the attention of numerous researchers for several reasons such as real-world applications as well as theoretical relations with several areas including Coding Theory. In this note an access structure of a secret sharing scheme associated to a linear code which is the Gray image of a two-weight linear code over a finit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015